A Study on Representative Skyline Using Connected Component Clustering
نویسندگان
چکیده
منابع مشابه
Maximum Coverage Representative Skyline
Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline points. However, existing approaches are not scaleinvariant, not stable, or must materialise the entire skyline. We introduce the maximum coverage representative skyline, which returns the k points collectively dominatin...
متن کاملDetection of Text with Connected Component Clustering
Text detection and recognition is a hot topic for researchers in the field of image processing. It gives attention to Content based Image Retrieval (CBIR) community in order to fill the semantic gap between low level and high level features. Several methods have been developed for text detection and extraction that achieve reasonable accuracy for natural scene text (camera images) as well as mu...
متن کاملDiscovering Representative Skyline Points over Distributed Data
Skyline queries help users make intelligent decisions over complex data. The main shortcoming of skyline queries is that the cardinality of the result set is not known a-priori. To overcome this limitation, the representative skyline query has been proposed, which retrieves a fixed set of k skyline points that best describe all skyline points. Even though the representative skyline has been stu...
متن کاملA Study of Connected Component Labeling Algorithms on the MPP
In this paper we consider the problem of labeling the connected components of a binary image. We descnbe three different algorithms and variations thereof which we implemented on NASA's MPP. These algoritluns include a simple label propagation algorithm. a version of Levialdi's algorithm, and an asymptotically optimal divide-and-eonquer algorithm. We discuss the perfonnance of these algorithms ...
متن کاملConnected component labeling on a 2D grid using CUDA
Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multimedia Information System
سال: 2019
ISSN: 2383-7632
DOI: 10.33851/jmis.2019.6.1.37